Cryptanalysis of the generalised Legendre pseudorandom function

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cryptanalysis of Pseudorandom Generators

As a motivating application for the study of lattice in cryptography we consider the construction of pseudorandom generators. We recall that a pseudorandom generator is a program G(x) (computable in deterministic polynomial time) that maps bitstrings x ∈ {0, 1} to longer strings G(x) ∈ {0, 1} such that, if x is chosen uniformly at random and kept secret, then the output G(x) will “look” random ...

متن کامل

Linear cryptanalysis of pseudorandom functions

In this paper, we study linear relations propagating across block ciphers from the key input to the ciphertext (for a fixed plaintext block). This is a usual setting of a one-way function, used for instance in modes of operation such as KFB (key feedback). We instantiate the block cipher with the full 16-round DES and s2-DES, 10-round LOKI91 and 24-round Khufu, for which linear relations with h...

متن کامل

Cryptanalysis of the Dual Elliptic Curve Pseudorandom Generator

The Dual Elliptic Curve Pseudorandom Generator (DEC PRG) is proposed by Barker and Kelsey [2]. It is claimed (see Section 10.3.1 of [2]) that the pseudorandom generator is secure unless the adversary can solve the elliptic curve discrete logarithm problem (ECDLP) for the corresponding elliptic curve. The claim is supported only by an informal discussion. No security reduction is given, that is,...

متن کامل

Line Bundles on Spectral Curves and the Generalised Legendre Transform

An analogue of the correspondence between GL(k)-conjugacy classes of matricial polynomials and line bundles is given for K-conjugacy classes, where K ⊂ GL(k) is one of the following: maximal parabolic, maximal torus, GL(k − 1) embedded diagonally. The generalised Legendre transform construction of hyperkähler metrics is studied further, showing that many known hyperkähler metrics (including the...

متن کامل

Cryptanalysis of LFSR-based Pseudorandom Generators - a Survey

Pseudorandom generators based on linear feedback shift registers (LFSR) are a traditional building block for cryptographic stream ciphers. In this report, we review the general idea for such generators, as well as the most important techniques of cryptanalysis.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Open Book Series

سال: 2020

ISSN: 2329-907X,2329-9061

DOI: 10.2140/obs.2020.4.267